The so-called fibonacci numbers in ancient and medieval India

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The So-called Fibonacci Numbers in Ancient and Medieval India

What are generally referred to as the Fibonacci numbers and the method for their formation were given by Virahanka (between A.D. 600 and X00). Gopala (prior to A.D. 1135) and Hemacandra (c. A.D. 1150). all prior to L. Fibonacci (c. A.D. 1202). Narayana Pandita (A.D. 13Sh) established a relation between his srftcisi~ci-pcrirLfi. which contains Fibonacci numbers as a particular case. and “the mul...

متن کامل

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

Contribution of Women to the Persian Language in Medieval India

Patriarchy, it seems today, has always been an integral part of the Indian society. A slight glance at the status of women in India today makes one think that women have always been considered inferior to men. History, however, says otherwise; women in India have historically had a greater role to play and have commanded far greater respect than they do today. It will therefore be justified to ...

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

The so-called Stabilizer Theorem

Theorem 1.1 (Hrushovski’s Theorem 3.5). Let G be a definable group, X a definable subset, and G̃ be the ∨-definable group generated by X. Suppose all this data is defined over a model M . Suppose μ is an M-invariant translation-invariant ideal on subsets of G̃. Let q be a wide type over M , contained in G̃. Identify q with its ∧-definable set of realizations. Suppose (F) there exist two realizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Historia Mathematica

سال: 1985

ISSN: 0315-0860

DOI: 10.1016/0315-0860(85)90021-7